Use of Eigenvalue and Eigenvectors to Analyze Bipartivity of Network Graphs
نویسنده
چکیده
This paper presents the applications of Eigenvalues and Eigenvectors (as part of spectral decomposition) to analyze the bipartivity index of graphs as well as to predict the set of vertices that will constitute the two partitions of graphs that are truly bipartite and those that are close to being bipartite. Though the largest eigenvalue and the corresponding eigenvector (called the principal eigenvalue and principal eigenvector) are typically used in the spectral analysis of network graphs, we show that the smallest eigenvalue and the smallest eigenvector (called the bipartite eigenvalue and the bipartite eigenvector) could be used to predict the bipartite partitions of network graphs. For each of the predictions, we hypothesize an expected partition for the input graph and compare that with the predicted partitions. We also analyze the impact of the number of frustrated edges (edges connecting the vertices within a partition) and their location across the two partitions on the bipartivity index. We observe that for a given number of frustrated edges, if the frustrated edges are located in the larger of the two partitions of the bipartite graph (rather than the smaller of the two partitions or equally distributed across the two partitions), the bipartivity index is likely to be relatively larger.
منابع مشابه
Network bipartivity and the transportation efficiency of European passenger airlines
The analysis of the structural organization of the interaction network of a complex system is central to understand its functioning. Here, we focus on the analysis of the bipartivity of graphs. We first introduce a mathematical approach to quantify bipartivity and show its implementation in general and random graphs. Then, we tackle the analysis of the transportation networks of European airlin...
متن کاملNetwork Bipartivity and the Transportation E ciency of European Passenger Airlines
The analysis of the structural organization of the interaction network of a complex system is central to understand its functioning. Here, we focus on the analysis of the bipartivity of graphs. We rst introduce a mathematical approach to quantify bipartivity and show its implementation in general and random graphs. Then, we tackle the analysis of the transportation networks of European airlines...
متن کاملGraph Prediction in Movie Graphs
Graphs can be used in applied in both an unsupervised and supervised context that can augment classification tasks. This paper focuses on a set of movie graphs that correspond to actor interactions in movies associated with various genres. I first compare the graph statistics between two disparate genres and perform random walks and analyze the eigenvalue and eigenvectors of the adjacency matri...
متن کاملProperties of first eigenvectors and eigenvalues of nonsingular weighted directed graphs
The class of nonsingular connected weighted directed graphs with an unweighted undirected branch is considered in this article. This paper investigates the monotonicity properties of the first eigenvectors of such graphs along certain paths. The paper describes how the first eigenvalue of such graphs changes under some perturbation. It is shown that replacing a branch which is a tree by a path ...
متن کاملComplex-Valued Neural Network for Hermitian Matrices
This paper proposes neural network for computing the eigenvectors of Hermitian matrices. For the eigenvalues of Hermitian matrices, we establish an explicit representation for the solution of the neural network based on Hermitian matrices and analyze its convergence property. We also consider to compute the eigenvectors of skew-symmetric matrices and skew-Hermitian matrices, corresponding to th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1412.6155 شماره
صفحات -
تاریخ انتشار 2014